2 . we prove that one kind of invertible autonomous automata has the same graph structure as its affine autonomous automata [ theorem 4.5 ] (2)证明了布尔环上的一类可逆线性内动机的图型与其仿射内动机的图型相同定理4.5。
2 . we prove that one kind of invertible autonomous automata has the same graph structure as its affine autonomous automata [ theorem 4.5 ] (2)证明了布尔环上的一类可逆线性内动机的图型与其仿射内动机的图型相同定理4.5。
3 . the graph structure of some non-invertible autonomous automata is discussed in regular space, orthogonal space, and orthonormal space respectively . some new results are derived [ theorem 3.10-3.13 ] (3)讨论了非可逆线性内动机在正规空间、直交空间、正交空间上的图型结构问题[定理3.103.13]。
We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact-equibranch down-oriented-tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4.1-4.4 ] 本文研究了有限布尔环上的内动机图型结构,取得了下列成果:(1)定出了布尔环上的一类具有等叉下向树形的线性内动机和一类可逆线性内动机的图型定理4.1~4.4]。
We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact-equibranch down-oriented-tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4.1-4.4 ] 本文研究了有限布尔环上的内动机图型结构,取得了下列成果:(1)定出了布尔环上的一类具有等叉下向树形的线性内动机和一类可逆线性内动机的图型定理4.1~4.4]。
We explore the graph structure of the autonomous automata over boolean ring and derive the following new results : 1 . we determine the graph structure of a kind of exact-equibranch down-oriented-tree autonomous automata and of a kind of invertible autonomous automata [ theorem 4.1-4.4 ] 本文研究了有限布尔环上的内动机图型结构,取得了下列成果:(1)定出了布尔环上的一类具有等叉下向树形的线性内动机和一类可逆线性内动机的图型定理4.1~4.4]。
In this thesis, we study the non-invertible linear finite autonomous automata and derive the following new results : 1 . a formula is given to count the number of the nodes of every level in a down-oriented tree of an autonomous automaton . then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact-equibranch down-oriented tree [ theorem 3.2-3.3 ] 本文研究了布尔代数上非可逆的线性内动机,取得了下列成果:(1)给出了线性内动机下向树形中每一层节点的计数公式和下向树是等叉下向树形的判定条件[定理3.23.3]。
In this thesis, we study the non-invertible linear finite autonomous automata and derive the following new results : 1 . a formula is given to count the number of the nodes of every level in a down-oriented tree of an autonomous automaton . then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact-equibranch down-oriented tree [ theorem 3.2-3.3 ] 本文研究了布尔代数上非可逆的线性内动机,取得了下列成果:(1)给出了线性内动机下向树形中每一层节点的计数公式和下向树是等叉下向树形的判定条件[定理3.23.3]。
In this thesis, we study the non-invertible linear finite autonomous automata and derive the following new results : 1 . a formula is given to count the number of the nodes of every level in a down-oriented tree of an autonomous automaton . then a necessary and sufficient condition is presented for the graph of an autonomous automaton to be an exact-equibranch down-oriented tree [ theorem 3.2-3.3 ] 本文研究了布尔代数上非可逆的线性内动机,取得了下列成果:(1)给出了线性内动机下向树形中每一层节点的计数公式和下向树是等叉下向树形的判定条件[定理3.23.3]。